explor domain dspecif term weight archiv question search transact data erp system expert find commun dbase greedi algorithm mine top dk influenti node mobil social network content denrich classifi web video classif evolutionari taxonomi construct dynam tag space gener framework explor categori inform question retriev commun question answer archiv mine signific semant locat gp data increas deploy gp enabl devic massiv amount gp data propos gener framework mine semant meaning signific locat shop mall restaur data present techniqu capabl extract semant locat gp data captur relationship locat locat user graph signific assign locat random walk graph propag signific locat mutual reinforc locat signific user author exploit determin signific aspect number visit locat durat visit distanc user travel reach locat studi million gp record confin spatio tempor region demonstr propos effect capabl outperform baselin method extens exist propos retriev top dk prestig dbase relev spatial web object locat awar keyword queri return rank object queri locat textual descript match queri keyword queri occur inher type mobil tradit web servic applic yellow page map servic previou work consid potenti result queri independ rank relev result object nearbi object relev queri prefer relev object relev nearbi object paper propos concept prestig base relev captur textual relev object queri effect nearbi object base type queri locat awar top prestig base text retriev lkpt queri propos retriev top spatial web object rank prestig base relev locat proxim propos algorithm comput lkpt queri empir studi real world spatial data demonstr lkpt queri effect retriev web object previou approach effect nearbi object show propos algorithm scalabl outperform baselin approach significantli retriev top dk prestig dbase relev spatial web object locat awar keyword queri return rank object queri locat textual descript match queri keyword queri occur inher type mobil tradit web servic applic yellow page map servic previou work consid potenti result queri independ rank relev result object nearbi object relev queri prefer relev object relev nearbi object paper propos concept prestig base relev captur textual relev object queri effect nearbi object base type queri locat awar top prestig base text retriev lkpt queri propos retriev top spatial web object rank prestig base relev locat proxim propos algorithm comput lkpt queri empir studi real world spatial data demonstr lkpt queri effect retriev web object previou approach effect nearbi object show propos algorithm scalabl outperform baselin approach significantli categor inform languag model question retriev revisit queri expans semant level rout question user onlin commun effici algorithm comput link dbase similar real world network effici retriev top dk relev spatial web object convent internet acquir geo spatial dimens web document geo tag geo referenc object point interest descript text document result fusion geo locat document enabl kind top queri take account locat proxim text relev knowledg naiv techniqu exist capabl comput gener web inform retriev queri take locat account paper propos index framework locationawar top text retriev framework leverag invert file text retriev tree spatial proxim queri index approach explor framework framework encompass algorithm util propos index comput top queri take account text relev locat proxim prune search space result empir studi implement framework demonstr paper propos offer scalabl capabl excel perform condit random field extract context answer question onlin forum onlin forum discuss vast amount question focus discuss extract context answer question yield coher forum summari valuabl qa knowledg base paper propos gener framework base condit random field crf detect context answer question forum thread improv basic framework skip chain crf crf accommod featur forum perform experiment result show techniqu promis semant similar base compact concept ontolog updat recurs xml view relat mine sequenti pattern tree pattern detect erron sentenc detect erron sentenc automat mine sequenti pattern paper studi problem identifi erron correct sentenc problem import applic provid feedback writer english languag control qualiti parallel bilingu sentenc mine web evalu machin translat result paper propos approach detect erron sentenc integr pattern discoveri supervis learn model experiment result show techniqu promis queri updat xml view updat recurs xml view relat queri xml updat syntax distribut queri evalu perform guarante improv data qualiti consist accuraci central criteria data qualiti consist accuraci inconsist error databas emerg violat integr constraint dirti databas autom method make consist find repair satisfi constraint minim differ equal import ensur automat gener repair accur make sens differ correct data predefin bound paper studi effect method improv data consist accuraci emploi class condit function depend cfd propos consist data captur inconsist error tradit counterpart catch improv consist data propos algorithm automat comput repair satisfi set cfd increment find repair respons updat clean databas show problem intract algorithm necessarili heurist experiment verifi method effect effici develop statist method guarante repair found algorithm accur predefin rate incur excess user interact explor composit acoust featur effici music similar queri annot propag revisit kei preserv view paper revisit analysi annot propag sourc databas view defin term conjunct spj queri sourc databas spj queri view tupl view view resp sourc side effect problem find minim set tupl delet result delet minim side effect view resp sourc problem refer annot placement problem find singl base tupl annot field propag minim propag field view import data proven manag view updat import problem np hard subclass spj view make annot propag analysi feasibl practic propos kei preserv condit spj view requir project field spj view retain kei base relat involv condit restrict propos simplifi annot propag analysi kei preserv spj view annot placement problem coincid view side effect problem view sourc side effect problem tractabl addit gener set allow group tupl delet investig insert tupl view show group updat make analysi harder problem np hard subclass spj view show spj view sourc view sideeffect problem np hard singl tupl insert tractabl subclass spj group insert presenc absenc kei preserv condit summar frequent pattern profil summar frequent pattern profil partial evalu distribut queri evalu basic idea parallel queri process prepar comput strictli individu site order reduc elaps time network traffic evalu queri develop idea evalu boolean xpath queri tree fragment horizont vertic number site kei idea send queri site partial evalu parallel queri send result compact boolean function coordin combin obtain result approach advantag site visit fragment tree store site prior constraint tree decompos need structur inform tree requir dtd satisfactori bound total comput perform site total network traffic develop simpl increment mainten algorithm requir commun site place network traffic depend data updat result illustr us potenti partial evalu distribut system central xml store evalu xpath queri effect dmail classif neural network mine top dk cover rule group gene express data semi dsupervis text classif partit em abstract text classif small label set larg unlabel data promis techniqu reduc labor intens time consum effort label train data order build accur classifi unlabel data easi web demonstr unlabel set improv classif accuraci significantli small label train set bayesian method assum text document gener mixtur model correspond mixtur compon class case applic real life applic class cover document topic violat oneto correspond assumpt case result classifi poor paper propos cluster base partit techniqu solv problem method partit train document hierarch fashion hard cluster run expect maxim em algorithm partit prune tree label data remain tree node partit satisfi oneto correspond condit extens experi demonstr method achiev dramat gain classif perform green recycl reus frequent pattern mine frequent close pattern microarrai data microarrai data typic larg number column small number row pose great challeng exist frequent close pattern mine algorithm discov pattern item enumer space paper propos algorithm explor row enumer space mine frequent close pattern experi real life gene express data show algorithm faster exist algorithm includ closet charm closet car penter farmer find interest rule group microarrai dataset microarrai dataset typic larg number column small number row associ rule prove analyz dataset exist associ rule mine algorithm unabl cientli handl dataset larg number column number associ rule gener dataset enorm due larg number column combin increment mainten quotient cube median data cube pre comput import concept support olap onlin analyt process studi extens feasibl comput complet data cube due huge storag requir recent propos quotient cube address issu partit method group cube cell equival partit approach distribut aggreg function sum appli holist aggreg function median maintain data cube holist aggreg hard problem difficulti li fact histori tupl valu order comput aggreg tupl insert delet quotient cube make problem harder maintain equival class paper introduc techniqu call addset data structur slide window deal problem develop effici algorithm maintain quotient cube holist aggreg function take small storag space perform studi show algorithm effect effici scalabl larg databas farmer find interest rule group microarrai dataset microarrai dataset typic larg number column small number row associ rule prove analyz dataset exist associ rule mine algorithm unabl cientli handl dataset larg number column number associ rule gener dataset enorm due larg number column combin cobbler combin column row enumer close pattern discoveri problem mine frequent close pattern receiv consider attent recent promis redund compar discov frequent pattern exist algorithm present separ group featur column enumer row enumer featur enumer algorithm charm closet effici dataset small number featur larg number row number featur combin enumer small row enumer algorithm carpent hand suitabl dataset bioinformat data larg number featur small number row group algorithm encount problem dataset larg number row featur paper describ algorithm call cob bler effici mine dataset cobbler design dynam switch featur enumer row enumer depend data characterist process mine portion dataset process suitabl method make mine effici experi real life synthet dataset show cobbler order magnitud previou close pattern mine algorithm charm closet carpent semant mine analysi gene express data associ rule reveal biolog relev relationship gene environ categori exist associ rule mine algorithm render impract gene express data typic thousand ten thousand column gene express level ten row sampl main problem algorithm exponenti depend number column shortcom evid associ gener kind data end develop depth row wise algorithm farmer special design cientli discov cluster associ rule interest rule group irg satisfi user minimum support confid chi squar threshold biolog dataset oppos find associ rule individu base farmer develop prototyp system integr semant mine visual analysi irg mine gene express data carpent find close pattern long biolog dataset characterist dataset typic larg number column small number row gene express dataset column row speed dup iter frequent itemset mine constraint mine frequent itemset fundament data mine task past research propos effici algorithm purpos recent work highlight import constraint focu mine process mine relev itemset practic data mine interact iter process user typic constraint run mine algorithm time satisfi final result interact process time consum exist mine algorithm unabl advantag iter process previou mine result speed current mine process result enorm wast time comput paper propos effici techniqu util previou mine result improv effici current mine constraint chang introduc concept tree boundari summar inform previou mine show tree boundari effect effici framework mine propos techniqu implement context exist frequent itemset mine algorithm fp tree tree project experi result synthet reallif dataset show propos approach achiev dramat save comput discov frequent substructur hierarch semi dstructur data abstract frequent substructur discoveri collect semi structur object serv storag brows queri index classif semi structur document paper examin problem discov frequent substructur collect hierarch semi structur object type wildcard import aspect substructur discoveri semi structur data due irregular lack fix structur data paper propos gener power wildcard mechan find complex interest substructur exist techniqu complex structur inform semi structur data usag wildcard make exist frequent set mine algorithm inapplic substructur discoveri work adopt vertic format storag semi structur object adapt frequent set mine algorithm purpos applic approach real life data show effect 